Accelerated matrix element method with parallel computing
نویسندگان
چکیده
منابع مشابه
Parallel computing for the finite element method
A finite element method is presented to compute time harmonic microwave fields in three dimensional configurations. Nodal-based finite elements have been coupled with an absorbing boundary condition to solve open boundary problems. This paper describes how the modeling of large devices has been made possible using parallel computation. New algorithms are then proposed to implement this formulat...
متن کاملAn improved Thomas Algorithm for finite element matrix parallel computing
With the expansion of the scale of linear finite element analyzing data, efficiency of computation is a main technical bottleneck. For solving the bottleneck, parallel computation is playing an increasingly prominent role. At present, the researches on linear finite element parallel computation are mainly concentrated on the preprocessing phase, and goal of these researches is to reduce the com...
متن کاملParallel Computing of Discrete Element Method on GPU
General purpose computing on GPU for scientific computing has been rapidly growing in recent years. We investigate the applicability of GPU to discrete element method (DEM) often used in particle motion simulation. NVIDIA provides a sample code for this type of simulation, which obtained superior performance than CPU in computational time. A computational model of the contact force in NVIDIA’s ...
متن کاملParallel Computing for Nonlinear Dynamic Finite Element Structural Analysis with General Sparse Matrix Technology
The principal objective of this research is to reduce the elapsed time of largescale nonlinear dynamic structural finite element analysis using parallel computing techniques. The major tasks and contributions of this research are: (a) employing the general sparse matrix technique to reduce the computing time and storage requirements for both sequential and parallel substructure analysis (b) emp...
متن کاملComputing the additive degree-Kirchhoff index with the Laplacian matrix
For any simple connected undirected graph, it is well known that the Kirchhoff and multiplicative degree-Kirchhoff indices can be computed using the Laplacian matrix. We show that the same is true for the additive degree-Kirchhoff index and give a compact Matlab program that computes all three Kirchhoffian indices with the Laplacian matrix as the only input.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2015
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2015.02.020